The countable admissible ordinal equivalence relation
نویسندگان
چکیده
منابع مشابه
The Full Group of a Countable Measurable Equivalence Relation
We study the group of all "R-automorphisms" of a countable equivalence relation R on a standard Borel space, special Borel automorphisms whose graphs lie in R. We show that such a group always contains periodic maps of each order sufficient to generate R . A construction based on these periodic maps leads to totally nonperiodic R-automorphisms all of whose powers have disjoint graphs. The prese...
متن کاملCountable Borel Equivalence Relations
This paper is a contribution to a new direction in descriptive set theory that is being extensively pursued over the last decade or so. It deals with the development of the theory of definable actions of Polish groups, the structure and classification of their orbit spaces, and the closely related study of definable equivalence relations. This study is motivated by basic foundational questions,...
متن کاملOrdinal machines and admissible recursion theory
We generalize standard Turing machines working in time ω on a tape of length ω to abstract machines with time α and tape length α, for α some limit ordinal. This model of computation determines an associated computability theory: α-computability theory. We compare the new theory to α-recursion theory, which was developed by G. Sacks and his school. For α an admissible ordinal, the basic notions...
متن کاملDynamic equivalence relation on the fuzzy measure algebras
The main goal of the present paper is to extend classical results from the measure theory and dynamical systems to the fuzzy subset setting. In this paper, the notion of dynamic equivalence relation is introduced and then it is proved that this relation is an equivalence relation. Also, a new metric on the collection of all equivalence classes is introduced and it is proved that this metric is...
متن کاملSelection in the monadic theory of a countable ordinal
A monadic formula (Y ) is a selector for a formula '(Y ) in a structure M if there exists a unique subset P of M which satis es and this P also satis es '. We show that for every ordinal ! there are formulas having no selector in the structure ( ;<). For !1, we decide which formulas have a selector in ( ;<), and construct selectors for them. We deduce the impossibility of a full generalization ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2017
ISSN: 0168-0072
DOI: 10.1016/j.apal.2016.12.002